Parity-Check-CRC Concatenated Polar Codes SSCFlip Decoder
نویسندگان
چکیده
Successive cancellation flip decoding requires a large number of extra successive attempts at low signal-to-noise ratios (SNRs), resulting in high complexity. In addition, it has long latency. Although modifications have been proposed decoding, these still computational complexity SNRs due to huge additional attempts. It is desirable detect the unsuccessful process an early stage and stop that can reduce This paper combines parity-check-CRC concatenated polar codes with low-latency simplified proposes (PC-CRC-SSCFlip) decoder. further employs parity-check vector identify terminates so minimize on average. Additionally, this work error-prone flipping list by incorporating empirically observed indices based channel-induced error distribution along first bit each Rate-1 node. The technique more than one through correct them. narrows down search space for identification erroneous decisions. Simulation results show 60% terminate rather decode whole codeword. PC-CRC-SSCFlip decoder approximately 0.7 dB 0.3 gains over decoders, respectively, fixed block rate (BLER) = 10−3. reduces average latency low-to-medium while approaching medium-to-high SNRs.
منابع مشابه
Construction of parity-check-concatenated polar codes based on minimum Hamming weight codewords
ELECT In this Letter, a new parity-check-concatenated (PCC) polar code construction that considers the number of minimum Hamming weight (MHW) codewords is proposed. The parity bits to reduce the number of MHW codewords as much as possible is successively constructed. The proposed construction can reduce the number of MHW codewords more than other codes. The results show that the proposed codes ...
متن کاملParallel and Serial Concatenated Single Parity Check Product Codes
The parallel and serial concatenation of codes is well established as a practical means of achieving excellent performance. In this paper, we introduce the parallel and serial concatenation of single parity check (SPC) product codes. The weight distribution of these codes is analyzed and the performance is bounded. Simulation results confirm these bounds at high signal-to-noise ratios. The perf...
متن کاملSerial Genetic Algorithm Decoder for Low Density Parity Check Codes
Genetic algorithms are successfully used for decoding some classes of error correcting codes, and offer very good performances for solving large optimization problems. This article proposes a new decoder based on Serial Genetic Algorithm Decoder (SGAD) for decoding Low Density Parity Check (LDPC) codes. The results show that the proposed algorithm gives large gains over sum-product decoder, whi...
متن کاملTurbo decoder architectures for low-density parity-check codes
Absnmt-Tubo deeding oflowdenrily pllityshrek (LDPC) and geme m b e d lowdensity (GLO) coda and the corresponding deeodor amhitoeh m s are mnridrred. A regular (c,r)-LDF'C code of length n is viewed s the interseetion of c intedrrvrd supersods where each smper.de is the dlred sum of n/r indepodent single pa.rity-cheek w b d l s E*dons e GLD coda dmply utilize mom pwellul subsoder. The turbo d d ...
متن کاملReduced-complexity decoding for concatenated codes based on rectangular parity-check codes and turbo codes
In this paper, we compare the performance of several different decoding strategies for concatenated codes based on a serial concatenation of a rectangular parity-check code (RPCC) with a turbo code. These concatenated codes are referred to as RPCC+turbo codes. RPCC+turbo codes have been shown to significantly outperform turbo codes in several scenarios [1],[2]. One particularly useful applicati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2022
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics11233839